#include <cstdio>
#include <algorithm>

using namespace std;

const int maxlength = 20005;
int dragon[maxlength], knight[maxlength];
int killed, cost;

int main() {
  int i, n, m;
  
  while (scanf("%d %d", &n, &m) == 2 && n && m) {
    for (i = 0; i < n; i++) {
      scanf("%d", &dragon[i]);
    }
    for (i = 0; i < m; i++) {
      scanf("%d", &knight[i]);
    }
    
    sort(dragon, dragon + n);
    sort(knight, knight + m);
    
    killed = 0;
    cost = 0;
    for (i = 0; i < m; i++) {
      if (knight[i] >= dragon[killed]) {
        cost += knight[i];
        if (++killed == n) {
          break;
        }
      }
    }
    
    if (killed == n) {
      printf("%d\n", cost);
    } else {
      printf("Loowater is doomed!\n");
    }
  }
  
  return 0;
}
